A* search
ALGORITHM USED FOR PATHFINDING AND GRAPH TRAVERSAL
A Star Search Algorithm; A star search algorithm; A-star algorithm; A-star search algorithm; A* algorithm; A* search; A-star; A Star; A star search; TBA*; New Bidirectional A*
<algorithm> A <a href="">grapha> search <a href="">algorithma>. A* is guaranteed to
find a minimal solution path before any other solution paths,
if a solution exists, in other words, it is an "<a href="">admissiblea>"
search algorithm. Each path is assigned a value based on the
cost of the path (e.g. its length) and an (under)estimate of
the cost of completing the path, i.e. the cost of a path from
the end of the current path to a solution.
(1995-03-31)